exponential complexity

exponential complexity
экспоненциальная сложность

Англо-русский словарь по компьютерной безопасности. . 2011.

Игры ⚽ Нужна курсовая?

Смотреть что такое "exponential complexity" в других словарях:

  • Exponential growth — The graph illustrates how exponential growth (green) surpasses both linear (red) and cubic (blue) growth.   Exponential growth …   Wikipedia

  • Exponential — may refer to any of several mathematical topics related to exponentiation, including: *Exponential function, also: **Matrix exponential, the matrix analogue to the above *Exponential decay *Exponential growth *Exponential map, in differential… …   Wikipedia

  • Exponential error — is an idea expressing how a very small error can compound itself over time. It can be characterized as the exponential growth of an error or the application of exponential growth in terms of an error. See also *Exponential growth *Computational… …   Wikipedia

  • Complexity class — In computational complexity theory, a complexity class is a set of problems of related resource based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using… …   Wikipedia

  • Exponential time — In complexity theory, exponential time is the computation time of a problem where the time to complete the computation, m ( n ), is bounded by an exponential function of the problem size, n . In other words, as the size of the problem increases… …   Wikipedia

  • Exponential decay — A quantity undergoing exponential decay. Larger decay constants make the quantity vanish much more rapidly. This plot shows decay for decay constants of 25, 5, 1, 1/5, and 1/25 for x from 0 to 5. A quantity is said to be subject to exponential… …   Wikipedia

  • Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… …   Wikipedia

  • Exponential hierarchy — In computational complexity theory, the exponential hierarchy is a hierarchy of complexity classes, starting with EXP:: m{EXP} = igcup {kinmathbb{N mbox{DTIME}left(2^{n^k} ight)and continuing with: m{2EXP} = igcup {kinmathbb{N… …   Wikipedia

  • Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …   Wikipedia

  • Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

  • Double exponential function — A double exponential function (red curve) compared to a single exponential function (blue curve). A double exponential function is a constant raised to the power of an exponential function. The general formula is , which grows much more quickly… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»